List-graph colouring for multiple depot vehicle scheduling
نویسندگان
چکیده
منابع مشابه
List Graph Colouring for Multiple Depot
This paper addresses a multiple depot vehicle scheduling problem (MDVSP) arising in public transportation. The general problem consists in assigning vehicles to trips while minimising the number of scheduled vehicles and the operational costs. The MDVSP considered here takes into account heterogeneous types of vehicles with complex relations among them. This special feature matches well situati...
متن کاملMultiple-Depot Integrated Vehicle and Crew Scheduling
This paper presents two different models and algorithms for integrated vehicle and crew scheduling in the multiple-depot case. The algorithms are both based on a combination of column generation and Lagrangian relaxation. Furthermore, we compare those integrated approaches with each other and with the traditional sequential one on random generated as well as real-world data instances for a subu...
متن کاملSolving the multiple-depot vehicle scheduling problem
The Multiple-Depot Vehicle Scheduling Problem (MDVSP) is the problem where one wants to assign timetabled tasks to vehicles which are housed in multiple depots. This problem is highly relevant for the public transport domain, as competition grows fierce and companies need to stay competitive to survive. As solving the MDVSP optimally is difficult in practice, the aim of this thesis is to give a...
متن کاملDevelopment of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملIterated local search for the multiple depot vehicle scheduling problem
The multiple depot vehicle scheduling problem (MDVSP) is a well-known and important problem arising in public transport. Although many solution approaches have been published in the literature, algorithms using metaheuristics appeared only very recently (Large Neighborhood Search and Tabu Search). In this paper, we introduce an Iterated Local Search algorithm for the MDVSP, incorporating a neig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics in Operational Research
سال: 2009
ISSN: 1757-5850,1757-5869
DOI: 10.1504/ijmor.2009.022883